Flipping Modules to Minimize Maximum Wire Length
نویسندگان
چکیده
منابع مشابه
Flipping letters to minimize the support of a string
We consider a problem defined on strings and inspired by the way DNA encodes amino-acids as triplets of nucleotides. Given a string s on an alphabet Σ, a word-length k and a budget D, we want to determine the smallest number of distinct kmers that can be left in s, if we are allowed to replace up to D letters of s. This problem has several parameters, and we discuss its complexity under all sor...
متن کاملClustering to Minimize the Maximum Intercluster Distance
The problem of clustering a set of points so as to minimize the maximum intercluster distance is studied. An O(kn) approximation algorithm, where n is the number of points and k is the number of clusters, that guarantees solutions with an objective function value within two times the optimal solution value is presented. This approximation algorithm succeeds as long as the set of points satisfie...
متن کاملBatch scheduling to minimize maximum lateness
We address the single-machine batch scheduling problem which arises when there are job families and setup requirements exist between these families; our objective is to minimize the maximum lateness. As our main result, we give an improved dynamic program for the solution of the problem. © 1997 Elsevier Science B.V. Kevwords: Analysis of algorithms; Dynamic programming; Production/scheduling
متن کاملFlipping Modules to Improve Circuit Performance and Routability
Preplaced modules may be flipped to improve performance and/or routability. We show that several versions of the module flipping problem are NP-hard. We propose algorithms to obtain module orientations that minimize the total wire length for module matrix and standard cell models. Additionally, we propose a heuristic to flip modules so as to minimize the length of the longest signal path. The r...
متن کاملDo Grammars Minimize Dependency Length?
A well-established principle of language is that there is a preference for closely related words to be close together in the sentence. This can be expressed as a preference for dependency length minimization (DLM). In this study, we explore quantitatively the degree to which natural languages reflect DLM. We extract the dependencies from natural language text and reorder the words in such a way...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: VLSI Design
سال: 1995
ISSN: 1065-514X,1563-5171
DOI: 10.1155/1995/69526